The regular viewpoint on PA-processes
نویسندگان
چکیده
منابع مشابه
The Regular Viewpoint on Pa−processes the Regular Viewpoint on Pa-processes
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest a view of PA-processes as tree languages. Our main result is that the set of iterated predecessors of a regular set of PA-processes is a regular tree language, and similarly for iterated successors. Furthermore, the corresponding tree-automata can be built eeectively in polynomial...
متن کاملThe Regular Viewpoint on PA-Processes
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest a view of PAprocesses as tree languages. Our main result is that the set of (iterated) predecessors of a regular set of PA-processes is a regular tree language, and similarly for (iterated) successors. Furthermore, the corresponding tree-automata can be built e ectively in polynom...
متن کاملThe Regular Viewpoint on PA - Pro esses
To appear in Theoretical Computer Science The Regular Viewpoint on PA-Pro esses D. Lugiez Lab. d'Informatique de Marseille, Univ. Aix-Marseille & CNRS URA 1787, 39, r. Joliot-Curie, 13453 Marseille Cedex 13, FRANCE and Ph. S hnoebelen Lab. Spe i ation and Veri ation, ENS de Ca han & CNRS UMR 8643, 61 av. Pdt Wilson, 94235 Ca han Cedex, FRANCE Abstra t PA is the pro ess algebra allowing non-dete...
متن کاملA regular viewpoint on processes and algebra
While different algebraic structures have been proposed for the treatment of concurrency, finding solutions for equations over these structures needs to be worked on further. This article is a survey of process algebra from a very narrow viewpoint, that of finite automata and regular languages. What have automata theorists learnt from process algebra about finite state concurrency? The title is...
متن کاملModel Checking PA-Processes
PA (Process algebra) is the name that has become common use to denote the algebra with a sequential and parallel operator (without communication), plus recursion. PA-processes subsume both Basic Parallel Processes (BPP) Chr93] and context-free processes (BPA). They are a simple model for innnite state concurrent systems. We show that the model checking problem for the branching time temporal lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00306-6